Convergence Analysis of Reweighted Sum-Product Algorithms
نویسندگان
چکیده
منابع مشابه
Convergence Analysis of Generalized Iteratively Reweighted Least Squares Algorithms on Convex Function Spaces
The computation of robust regression estimates often relies on minimization of a convex functional on a convex set. In this paper we discuss a general technique for a large class of convex functionals to compute the minimizers iteratively which is closely related to majorization-minimization algorithms. Our approach is based on a quadratic approximation of the functional to be minimized and inc...
متن کاملApproximation Algorithms for Max-Sum-Product Problems
Many tasks in probabilistic reasoning can be cast as max-sum-product problems, a hard class of combinatorial problems. We describe our results in obtaining a new approximation scheme for the problem, that can be turned into an anytime procedure. For many tasks, this scheme can be shown to be asymptotically the best possible heuristic.
متن کاملSufficient conditions for convergence of the Sum-Product Algorithm
Novel conditions are derived that guarantee convergence of the Sum-Product algorithm (also known as Loopy Belief Propagation or simply Belief Propagation) to a unique fixed point, irrespective of the initial messages, for parallel (synchronous) updates. The computational complexity of the conditions is polynomial in the number of variables. In contrast with previously existing conditions, our r...
متن کاملConvergence of the Reweighted `1 Minimization Algorithm
The iteratively reweighted `1 minimization algorithm (IRL1) has been widely used for variable selection, signal reconstruction and image processing. However the convergence of the IRL1 has not been proved. In this paper, we prove that any sequence generated by the IRL1 is bounded and any accumulation point is a stationary point of the `2-`p minimization problem with 0 < p < 1. Moreover, the sta...
متن کاملConvergence of Reweighted `1 Minimization Algorithms and Unique Solution of Truncated `p Minimization
Extensive numerical experiments have shown that the iteratively reweighted `1 minimization algorithm (IRL1) is a very efficient method for variable selection, signal reconstruction and image processing. However no convergence results have been given for the IRL1. In this paper, we first give a global convergence theorem of the IRL1 for the `2-`p (0 < p < 1) minimization problem. We prove that a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Signal Processing
سال: 2008
ISSN: 1053-587X
DOI: 10.1109/tsp.2008.924136